Modified Dunn’s cluster validity index based on graph theory

ثبت نشده
چکیده

Clustering methods serve as common tools for efficient data analysis in many fields of science. The essential, yet often neglected, step in the cluster analysis is validation of the clustering results. This paper presents a novel cluster validity index, which is the modification of the well-known Dunn’s index. Our proposal is based on its generalization considering the shortest paths between data points in the Gabriel graph. The experiments show that the proposed index can be successfully applied in the validation of the partitions, even when they contain complex-shaped clusters. Streszczenie. Klasteryzacja danych jest często wykorzystywanym narzędziem analizy w wielu dziedzinach nauki. Ważny, choć często zaniedbywany etap klasteryzacji to ocena wyników tego rodzaju analizy. W pracy tej zaprezentowano nowy indeks oceny klastrów, będący modyfikacją indeksu Dunna. Podejście proponowane w tej pracy jest uogólnieniem, bazującym na poszukiwaniu najkrótszej drogi pomiędzy punktami w grafie Gabriela. Przeprowadzone eksperymenty potwierdzają, że proponowany indeks może być stosowany do oceny podziałów zbiorów danych, nawet jeśli zawierają one klastry o skomplikowanych kształtach. (Zmodyfikowany indeks oceny klastrów Dunna oparty na teorii grafów.)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dunn's cluster validity index as a contrast measure of VAT images

This paper addresses the relationship between the Visual Assessment of cluster Tendency (VAT) algorithm and Dunn’s cluster validity index. We present an analytical comparison in conjunction with numerical examples to demonstrate that the effectiveness of VAT in showing cluster tendency is directly related to Dunn’s index. This analysis is important to understanding the underlying theory of VAT ...

متن کامل

Performance Evaluation of Some Clustering Algorithms and Validity Indices

In this article, we evaluate the performance of three clustering algorithms, hard K-Means, single linkage, and a simulated annealing (SA) based technique, in conjunction with four cluster validity indices, namely Davies-Bouldin index, Dunn’s index, Calinski-Harabasz index, and a recently developed index I . Based on a relation between the index I and the Dunn’s index, a lower bound of the value...

متن کامل

Cluster Validity Measures Dynamic Clustering Algorithms

Cluster analysis finds its place in many applications especially in data analysis, image processing, pattern recognition, market research by grouping customers based on purchasing pattern, classifying documents on web for information discovery, outlier detection applications and act as a tool to gain insight into the distribution of data to observe characteristics of each cluster. This ensures ...

متن کامل

Nonparametric Genetic Clustering: Comparison of Validity Indices

Variable string length genetic algorithm (GA) is used for developing a novel nonparametric clustering technique when the number of clusters is not fixed a priori. Chromosomes in the same population may now have different lengths since they encode different number of clusters. The crossover operator is redefined to tackle the concept of variable string length. Cluster validity index is used as a...

متن کامل

A note on connectivity and lambda-modified Wiener index

In theoretical chemistry, -modified Wiener index is a graph invariant topological index to analyze the chemical properties of molecular structure. In this note, we determine the minimum -modified Wiener index of graph with fixed connectivity or edge-connectivity. Our results also present the sufficient and necessary condition for reaching the lower bound.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013